Community elicitation from co-occurrence of activities
نویسندگان
چکیده
منابع مشابه
Disentangling community patterns of nestedness and species co-occurrence
Two opposing patterns of meta-community organization are nestedness and negative species co-occurrence. Both patterns can be quantified with metrics that are applied to presence-absence matrices and tested with null model analysis. Previous meta-analyses have given conflicting results, with the same set of matrices apparently showing high nestedness (Wright et al. 1998) and negative species co-...
متن کاملSpeech error elicitation and co-occurrence restrictions in two Ethiopian Semitic languages.
This article reports the results of speech error elicitation experiments investigating the role of two consonant co-occurrence restrictions in the productive grammar of speakers of two Ethiopian Semitic languages, Amharic and Chaha. Higher error rates were found with consonant combinations that violated co-occurrence constraints than with those that had only a high degree of shared phonological...
متن کاملDetection of stable community structures within gut microbiota co-occurrence networks from different human populations
Microbes in the gut microbiome form sub-communities based on shared niche specialisations and specific interactions between individual taxa. The inter-microbial relationships that define these communities can be inferred from the co-occurrence of taxa across multiple samples. Here, we present an approach to identify comparable communities within different gut microbiota co-occurrence networks, ...
متن کاملMotion characterization from co-occurrence vector descriptor
A novel operator called the co-occurrence vector to be used for motion characterization is presented. The vector has the advantage of requiring low computation complexity. It allows estimating the relative position, the scale and the rotation of objects in the scene image. This estimation may be useful for obtaining time to impact and relative distance between objects for navigation and collisi...
متن کاملExtracting Co-Occurrence Relations from ZDDs
A zero-suppressed binary decision diagram (ZDD) is a graph representation suitable for handling sparse set families. Given a ZDD representing a set family, we present an efficient algorithm to discover a hidden structure, called a co-occurrence relation, on the ground set. This computation can be done in time complexity that is related not to the number of sets, but to some feature values of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Generation Computer Systems
سال: 2020
ISSN: 0167-739X
DOI: 10.1016/j.future.2019.10.046